A Parallel Lanczos Algorithm for Eigensystem Calculation
نویسنده
چکیده
Eigenvalue problems arise in many fields of physics and engineering science for example in structural engineering from prediction of dynamic stability of structures or vibrations of a fluid in a closed cavity. Their solution consumes a large amount of memory and CPU time if more than very few (1-5) vibrational modes are desired. Both make the problem a natural candidate for parallel processing. Here we shall present some aspects of the solution of the generalized eigenvalue problem on parallel architectures with distributed memory.
منابع مشابه
Parallel calculation of electron multiple scattering using Lanczos algorithms
Real space multiple scattering calculations of the electronic density of states and x-ray spectra in solids typically scale as the cube of the system and basis set size, and hence are highly demanding computationally. For example, such x-ray absorption near edge structure ~XANES! calculations typically require clusters of order NR atoms and s, p, and d states for convergence, with NR between ab...
متن کاملSharpness in Rates of Convergence For CG and Symmetric Lanczos Methods
Conjugate Gradient (CG) method is often used to solve a positive definite linear system Ax = b. Existing bounds suggest that the residual of the kth approximate solution by CG goes to zero like [( √ κ− 1)/(√κ + 1)], where κ ≡ κ(A) = ‖A‖2‖A−1‖2 is A’s spectral condition number. It is well-known that for a given positive definite linear system, CG may converge (much) faster, known as superlinear ...
متن کاملParallel Efficiency of the Lanczos Method for Eigenvalue Problems
Two of the commonly used versions of the Lanczos method for eigenvalues problems are the shift-and-invert Lanczos method and the restarted Lanczos method. In this talk, we will address two questions, is the shift-and-invert Lanczos method a viable option on massively parallel machines and which one is more appropriate for a given eigenvalue problem?
متن کاملA Parallel Implementation of Lanczos Algorithm in SVD Computation
This work presents a parallel implementation of Lanczos algorithm for SVD Computation using MPI. We investigate execution time as a function of matrix sparsity, matrix size, and the number of processes. We observe speedup and slowdown for parallelized Lanczos algorithm. Reasons for the speedups and the slowdowns are discussed in the report.
متن کاملA New Parallel Approach to the Block Lanczos Algorithm for Finding Nullspaces over GF(2)
Its goal is to propose a new parallel algorithm to calculate the nullspace of a given huge matrix, in the field of GF(2). This parallel algorithm is mainly based on the Block Lanczos algorithm, but it presents a new way for distributing the matrix elements as well as minimizing the communication time. This thesis contains the necessary theoretical background and concludes with experimental resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998